An Adaptive Planner
نویسنده
چکیده
This paper is about an approach to the flexible utilization of old plans called adaptive planning. An adaptive planner can take advantage of the details associated with specific plans, while still maintaining the flexibility of a planner that works from general plans. Key elements in the theory of adaptive planning are its treatment of background knowledge and the introduction of a notion of planning by situation matching.
منابع مشابه
Adaptive Path Planner for Highly Dynamic Environments
This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Assoc...
متن کاملIntelligent adaptive immune-based motion planner of a mobile robot in cluttered environment
Learning of an autonomous mobile robot for path generation includes the use of previous experience to obtain the better path within its work space. When the robot is moving in its search space for target seeking, each task requires different form of learning. Therefore, the modeling of an efficient learning mechanism is the hardest problem for an autonomous mobile robot. To solve this problem, ...
متن کاملAdaptive Strategies for Probabilistic Roadmap Construction
This paper presents an experimental study of prospects for using adaptable local search techniques in probabilistic roadmap based motion planning. The classical PRM approach uses a single fast and simple local planner to build a network representation of the configuration space. Advanced PRM planners utilize heuristic sampling techniques and combine multiple local planners. The planner describe...
متن کاملAdaptive Sampling Applied to Planning with Hindsight Optimization
Generating plans in stochastic planning enviironments is a difficult and time consuming process even with state of the art planners such as FF-Hindsight. This research applies a series of adaptive sampling methods around FF-Hindsight to improve the quality of plans returned by the planner as well as allowing the planner to modify the time it takes to make a decision on an action and base it on ...
متن کاملUsing the k-Nearest Problems for Adaptive Multicriteria Planning
This paper concerns the design and development of an adaptive planner that is able to adjust its parameters to the characteristics of a given problem and to the priorities set by the user concerning plan length and planning time. This is accomplished through the implementation of the k nearest neighbor machine learning algorithm on top of a highly adjustable planner, called HAP. Learning data a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986